Bayesian Predictions in M/G/ 1 Queueing System
نویسندگان
چکیده
In this paper we consider M/G/1 queueing system. We assume that there is a single server and the customers arrive according to Poisson process with mean and service time distribution is general. Let the state of the system be defined by a pair of variables the number X(t) in the system at epoch t and the elapsed serviced time Y(t) of the customer who is under going service. Then we have studied the bivariate Markovian process {X(t), Y(t)} in order to obtain the results of Non-Markovian process {X(t)}. In M/G/1 queueing system customer’s arrival follow a Poisson process with mean rate and are served one at a time on FCFS basis. The general aim here is to analyze from Bayesian point of view the available information about the unknown parameter vector = ( , μ). To obtain sample information about the queue system, we observe n interarrival times say xi (i=1, 2, ....n) and simultaneously or not, m complete service times yj (j=1, 2, ....m). This design is not the one most widely used by the classical approach providing complete sample information about the system which consists in observing the arrival and service processes simultaneously and continuously over a fixed period of time.
منابع مشابه
Emergency Location Problems with an M/G/k Queueing System
Since late 1960's, the emergency location problems, fire stations and medical emergency services have attracted the attention of researchers. Mathematical models, both deterministic and probabilistic, have been proposed and applied to find suitable locations for such facilities in many urban and rural areas. Here, we review some models proposed for finding the location of such facilities, wit...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملAnalysis of M/G/ 1 queueing model with state dependent arrival and vacation
This investigation deals with single server queueing system wherein the arrival of the units follow Poisson process with varying arrival rates in different states and the service time of the units is arbitrary (general) distributed. The server may take a vacation of a fixed duration or may continue to be available in the system for next service. Using the probability argument, we construct the ...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملOn Bayesian inference for the M/G/1 queue with efficient MCMC sampling
We introduce an efficient MCMC sampling scheme to perform Bayesian inference in the M/G/1 queueing model given only observations of interdeparture times. Our MCMC scheme uses a combination of Gibbs sampling and simple Metropolis updates together with three novel “shift” and “scale” updates. We show that our novel updates improve the speed of sampling considerably, by factors of about 60 to abou...
متن کامل